Completeness and Non-Completeness Results with Respect to Read-Once Projections
نویسندگان
چکیده
منابع مشابه
Completeness results for metrized rings and lattices
The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (for example, ${0})$ that are closed under the natural metric, but has no prime ideal closed under that metric; hence closed radical ideals are not, in general, intersections of closed prime ideals. Moreover, $B$ is known to be complete in its metric. Togethe...
متن کاملCompleteness with Respect to the Probabilistic Pompeiu-hausdorff Metric
The aim of the present paper is to prove that the family of all closed nonempty subsets of a complete probabilistic metric space L is complete with respect to the probabilistic Pompeiu-Hausdorff metric H . The same is true for the families of all closed bounded, respectively compact, nonempty subsets of L. If L is a complete random normed space in the sense of Šerstnev, then the family of all n...
متن کاملCompleteness of S4 with respect to the real line: revisited
We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski (Ann. of Math. (2) 45 (1944) 141). We also prove that the same result holds for the bimodal system S4 + S5 + C, which is a strengthening of a 1999 result of Shehtman (J. Appl. Non-Classical Logics 9 (1999) 369). © 2004 ...
متن کاملa comparison of teachers and supervisors, with respect to teacher efficacy and reflection
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
15 صفحه اولCompleteness Results for Circumscription
We inv estigate the model theory of the notion of circumscription, and find completeness theorems that provide a partial converse to a result of McCarthy. We show that the circumscriptive theorems are precisely the truths of the minimal models, in the case of various classes of theories, and for various versions of circumscription. We also present an example of commonsense reasoning in which fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1998
ISSN: 0890-5401
DOI: 10.1006/inco.1998.2710